منابع مشابه
Interactive Graph Algorithm Visualization and the GraViz Prototype
Visualizing a graph of any complexity can be di cult, particularly if arbitrary details decorating both the vertex set and arc set are required to be rendered. A graph algorithm visualizing tool GraViz has been developed using Java and Java-Swing rendering technology. The design ideas and data structures used in GraViz are presented and some directions for future enhancement are discussed. A de...
متن کاملInteractive Visualization of Graph Pyramids
Graph or image pyramids can be used for hierarchical partitioning of images. One related application area is the automatical determination of landscapes in Landscape Ecology. The visualization of graph pyramids facilitates studies about their structure, such as their vertex distribution or height in relation of a specific input image. Thus, a researcher can debug algorithms and ask for statisti...
متن کاملInteractive, Tree-Based Graph Visualization
We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main contributions are a graph drawing algorithm that generates meaningful representations of graphs us...
متن کاملCGV - An interactive graph visualization system
Previous work on graph visualization has yielded a wealth of efficient graph analysis algorithms and expressive visual mappings. To support the visual exploration of graph structures, a high degree of interactivity is required as well. We present a fully implemented graph visualization system, called CGV (Coordinated Graph Visualization), whose particular emphasis is on interaction. The system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Novosibirsk Computing Center. Series:Computer Science
سال: 2012
ISSN: 2542-1972
DOI: 10.31144/bncc.cs.2542-1972.2012.n34.p93-103